Randomized Self-Stabilizing Leader Election (Extended Abstract)
نویسنده
چکیده
منابع مشابه
Low-Communication Self-stabilizing Leader Election in Large Networks
This paper makes two contributions: (1) On a completely connected network of n anonymous processes, it presents a synchronous randomized algorithm to solve the weak leader election problem in expected O(1) time using O( √ n logn) messages with high probability, (2) It presents a self-stabilizing algorithm for the strong leader election problem on a completely connected network of processes with...
متن کاملSelf-Stabilizing Unidirectional Network Algorithms by Power-Supply (Extended Abstract)
Power-supply, a surprisingly simple and new general paradigm for the development of self-stabilizing algorithms in diierent models, is introduced. The paradigm is exempliied by developing simple and eecient self-stabilizing algorithms for leader election and either BFS or DFS spanning tree constructions, in strongly-connected unidirectional and bi-directional dynamic networks (synchronous and a...
متن کاملSelf-stabilizing Leader Election in Networks of Finite-State Anonymous Agents
This paper considers the self-stabilizing leader-election problem in a model of interacting anonymous finite-state agents. Leader election is a fundamental problem in distributed systems; many distributed problems are easily solved with the help of a central coordinator. Selfstabilizing algorithms do not require initialization in order to operate correctly and can recover from transient faults ...
متن کاملDeterministic silence and self stabilizing leader election algorithm on id based ring
We present in this paper a deterministic silence and self stabilizing leader election algorithm on unidirectional id based rings which have a bound on their id values The id values of proces sors in a ring whose size is N have to be inferior to N k The size of communication registers required by the algorithm is constant The algorithm stabilizes in k N time keywords self stabilization leader el...
متن کاملStabilizing token schemes for population protocols
In this paper we address the stabilizing token circulation and leader election problems in population protocols model augmented with oracles. Population protocols is a recent model of computation that captures the interactions of biological systems. In this model emergent global behavior is observed while anonymous finite-state agents(nodes) perform local peer interactions. Uniform self-stabili...
متن کامل